/*================================================================
*   Copyright (C) 2019 Guangzhou Firefly Ltd. All rights reserved.
*   
*   文件名称：least_common_multiple.c
*   创 建 者：luhuadong
*   创建日期：2019年10月28日
*   描    述：求最小公倍数
*
================================================================*/


#include <stdio.h>

typedef unsigned int uint;

/* greatest common divsor */
uint gcd(uint a, uint b)
{
	if(b == 0)
		return a;

	return gcd(b, a%b);

}

/* least common multiple */
uint lcm(uint a, uint b)
{
	if(a < 1 || b < 1)
		return 0;

	if(a < b) {
	
		a = a + b;
		b = a - b;
		a = a - b;
	}

	return (a*b / gcd(a, b));
}

int main(void)
{
	uint a=0, b=0;
	scanf("%u %u", &a, &b);

	printf("%u\n", lcm(a, b));
}
